A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
نویسندگان
چکیده
منابع مشابه
Constructing a Maximal Independent Set in Parallel
f a The problem of constructing in parallel a maximal independent set o given graph is considered. A new deterministic NC -algorithm implet mented in the EREW PRAM model is presented. On graphs with n ver ices and m edges, it uses O ((n +m )/logn ) processors and runs in O (log n ) 3 c time. This reduces by a factor of logn both the running time and the pro essor count of the previously fastest...
متن کاملA Parallel Maximal Independent Set Algorithm
The parallel construction ofmaximal independent sets is a useful building block for many algorithms in the computational sciences, including graph coloring and multigrid coarse grid creation on unstructured meshes. We present an e cient asynchronous maximal independent set algorithm for use on parallel computers, for \well partitioned" graphs, that arise from nite element (FE) models. For appro...
متن کاملParallel algorithms for the maximal independent set problem in graphs
In this paper we describe the randomized parallel algorithm proposed by Blelloch et al. [BFS12] to compute a Maximal Independent Set (MIS) of a given graph. We implemented their algorithm as well as the fastest sequential algorithm and compared their performance with different input graphs. Furthermore, we compared the number of rounds in both the sequential and parallel algorithms and present ...
متن کاملA work-optimal coarse-grained parallel algorithm for Lexicographically First Maximal Independent Set
The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is P-complete, and thus not parallelizable in a fine-grained setting unless P=NC. On the other hand, we show that in a coarse-grained setting the situation is quite different, by giving a work-optimal algorithm on a shared memory machine with up to log n processors, for any 0 < δ < 1. 1 Motivation and Ba...
متن کاملTowards an Optimal Distributed Algorithm for Maximal Independent Set
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents an extremely simple randomized algorithm providing a near-optimal local complexity for this problem, which incidentally, when combined with some known techniques, also leads to a near-optimal global complexity. Classical MIS algorithms of Luby [STOC’85] an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90106-5